New Tools for Proving Dualizability
نویسنده
چکیده
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in the sense of [1]. There are generally two aspects to the problem: (1) handling the finite members of SP(M), and (2) handling the infinite members of SP(M). In principle, the problem rests entirely at the infinite level (that is, in the second aspect). In practice, however, the real work is typically done at the finite level; then the analysis is “lifted” to the infinitely level by a suitable combinatorial argument. In this paper we give two “lifting theorems,” one for dualizability and the other for strong dualizability, which may prove useful in this enterprise.
منابع مشابه
Full Duality among Graph Algebras and Flat Graph Algebras
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full dualizability, strong dualizability and entropicity are all equivalent. Any finite (flat) graph algebra which is not dualizable must be inherently non-κ-dualizable for every infinite cardinal κ. A new, general method for proving strong duality is presented.
متن کاملHow Finite is a Three-Element Unary Algebra?
A full duality gives us a natural dual equivalence between a quasi-variety generated by a finite algebra and a class of structured topological spaces. There are many well-known examples of full dualities: Stone’s duality for Boolean algebras [12], Priestley’s duality for distributive lattices [11], and the Hofmann, Mislove, Stralka duality for semilattices [6]. A finite algebra M is called full...
متن کاملProving Nontermination via Safety
We show how the problem of nontermination proving can be reduced to a question of underapproximation search guided by a safety prover. This reduction leads to new nontermination proving implementation strategies based on existing tools for safety proving. Our preliminary implementation beats existing tools. Furthermore, our approach leads to easy support for programs with unbounded nondetermini...
متن کاملتوسعه روش SL با ترتیب KBO برای اثبات خودکار پایانپذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران
The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...
متن کاملA note on decision making in medical investigations using new divergence measures for intuitionistic fuzzy sets
Srivastava and Maheshwari (Iranian Journal of Fuzzy Systems 13(1)(2016) 25-44) introduced a new divergence measure for intuitionisticfuzzy sets (IFSs). The properties of the proposed divergence measurewere studied and the efficiency of the proposed divergence measurein the context of medical diagnosis was also demonstrated. In thisnote, we point out some errors in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007